Improved Non-approximability Results for Vertex Cover with Density Constraints
نویسندگان
چکیده
We provide new non-approximability results for the restrictions of the Min Vertex Cover problem to bounded-degree, sparse and dense graphs. We show that, for a suuciently large B, the recent 16/15 lower bound proved by Bellare et al. 3] extends with negligible loss to graphs with bounded degree B. Then, we consider sparse graphs with no dense components (i.e. everywhere sparse graphs), and we show a similar result but with a better trade-oo between non-approximability and sparsity. Finally we observe that the Min Vertex Cover problem remains APX-complete when restricted to dense graph and thus recent techniques developed by Arora et al. 1] for several Max SNP problems restricted to \dense" instances cannot be applied.
منابع مشابه
Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints
We provide new non-approximability results for the restrictions of the Min Vertex Cover problem to bounded-degree, sparse and dense graphs. We show that for a suuciently large B, the recent 16/15 lower bound proved by Bellare et al. 5] extends with negligible loss to graphs with bounded degree B. Then, we consider sparse graphs with no dense components (i.e. everywhere sparse graphs), and we sh...
متن کاملParameterized Complexity of Generalized Vertex Cover Problems
Important generalizations of the Vertex Cover problem (Connected Vertex Cover,Capacitated Vertex Cover, andMaximum Partial Vertex Cover) have been intensively studied in terms of approximability. However, their parameterized complexity has so far been completely open. We close this gap here by showing that, with the size of the desired vertex cover as parameter, Connected Vertex Cover and Capac...
متن کاملCovering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its elements (adjacent edges) and the number of available copies of each set (vertex) is bounded. This is a natural generalization of the classical problems that also captures resource limitations in practical scenarios. ...
متن کاملOn Approximation Hardness of the Minimum 2SAT-DELETION Problem
The Minimum 2SAT-Deletion problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems [8], and its approximability is largely open. We prove a lower approximation bound of 8 √ 5 − 15 ≈ 2.88854, improving the previous bound of 10 √ 5 − 21 ≈ 1.36067 by Dinur and Safra [5]. For h...
متن کاملDual parameterization and parameterized approximability of subset graph problems
We discuss approximability in FPT-time for the class of subset optimization graph problems where a feasible solution S is a subset of the vertex set of the input graph. This class encompasses many well-known problems, such as min dominating set, min vertex cover, max independent set, min feedback vertex set. We study approximability of such problems with respect to the dual parameter n − k wher...
متن کامل